Regular Model Checking Using Inference of Regular Languages

Regular Model Checking Using Inference of Regular Languages

Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a new general approach to regular model checking based on inference of regular languages. The method builds upon the observation that for infinite-state systems...

Inference of Regular Languages using Model Simplicity

We describe an approach that is related to a number of existing algorithms for the inference of a regular language from a set of positive (and optionally also negative) examples. Variations on this approach provide a family of algorithms that attempt to minimise the complexity of a description of the example data in terms of a finite state automaton model. Experiments using a standard set of sm...

Regular Tree Model Checking

Regular Hedge Model Checking

We extend the regular model checking framework so that it can handle systems with arbitrary width tree-like structures. Configurations of a system are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamics of a system is modeled by a regular hedge transducer. We consider the problem of computing the transitive closure T + of...

Beyond Regular Model Checking

In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriication problems that cannot be described by regular languages, and thus cannot be veri-ed using regular model checking. In this study we try to practice symbolic model checking using classes of languages more e...